package com.wc.fortnight_blue_bridge.Q231125.Q8732;

import java.util.Scanner;

/**
 * @Author congege
 * @Description https://www.lanqiao.cn/oj-contest/challenge-4/
 * @Date Created in 2023/11/26-12:07
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int q = sc.nextInt();
        int[] powers = new int[m + 1];
        for (int i = 1; i <= m; i++) {
            powers[i] = sc.nextInt();
        }
        // dp[i][j] 表示第i类,对于原来的内容影响,最后
        int[][] dp = new int[m + 5][n + 5];

        while (q-- > 0) {
            int type = sc.nextInt();
            int l = sc.nextInt();
            int r = Math.min(l + powers[type] - 1,n);
            dp[type][l] += 1;
            dp[type][r + 1] -= 1;
        }
        int[] ansArray = new int[n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] += dp[i][j - 1];
                if (dp[i][j] > 0) {
                    ansArray[j]++;
                }
            }
        }
        StringBuffer ans = new StringBuffer();
        ans.append(ansArray[1]);
        for (int i = 2; i <=n ; i++) {
            ans.append(' ');
            ans.append(ansArray[i]);
        }
        System.out.println(ans);
    }
}
